Blind deconvolution of discrete linear systems
نویسندگان
چکیده
منابع مشابه
Blind image deconvolution of linear motion blur
We present an efficient method to deblur images for information recognition. The method is successfully applied directly on mobile devices as a preprocessing phase to images of barcodes. Our main contribution is the fast identifaction of blur length and blur angle in the frequency domain by an adapted radon transform. As a result, the barcode recognition rate of the deblurred images has been in...
متن کاملOptimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کاملUndercomplete Blind Subspace Deconvolution Via Linear Prediction
We present a novel solution technique for the blind subspace deconvolution (BSSD) problem, where temporal convolution of multidimensional hidden independent components is observed and the task is to uncover the hidden components using the observation only. We carry out this task for the undercomplete case (uBSSD): we reduce the original uBSSD task via linear prediction to independent subspace a...
متن کاملMulti-frame blind deconvolution with linear equality constraints
The Phase Diverse Speckle (PDS) problem is formulated mathematically as Multi Frame Blind Deconvolution (MFBD) together with a set of Linear Equality Constraints (LECs) on the wavefront expansion parameters. This MFBD–LEC formulation is quite general and, in addition to PDS, it allows the same code to handle a variety of different data collection schemes specified as data, the LECs, rather than...
متن کاملDiscrete-Time Linear Systems
The least-squares transformation of a discrete-time multivariable linear system into a desired one by convolving the first with-a polynomial system yields optimal polynomial solutions to the problems of system compensation, inversion and approximation. The polynomial coefficients are obtained from the solution to a so-called normal linear matrix equation, whose coefficients are shown to be the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1996
ISSN: 0090-5364
DOI: 10.1214/aos/1069362305